JESS facility modification and environmental/power plans

Preliminary plans for facility modifications and environmental/power systems for the JESS (Joint Exercise Support System) computer laboratory and Freedom Hall are presented. Blueprints are provided for each of the facilities and an estimate of the air conditioning requirements is given

Automated CPX support system preliminary design phase

The development of the Distributed Command and Control System (DCCS) is discussed. The development of an automated C2 system stimulated the development of an automated command post exercise (CPX) support system to provide a more realistic stimulus to DCCS than could be achieved with the existing manual system. An automated CPX system to support corps-level exercise was designed. The effort comprised four tasks: (1) collecting and documenting user requirements; (2) developing a preliminary system design; (3) defining a program plan; and (4) evaluating the suitability of the TRASANA FOURCE computer model

SELECTED ISSUES AND FEATURES OF UNDERGRADUATE INSTRUCTION IN AGRICULTURAL ECONOMICS

Teaching/Communication/Extension/Profession,

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets). First we consider the problem of finding an "arc-consistent" representation ("AC"), meaning that unit-clause propagation will fix all forced assignments for all possible instantiations of the xor-variables. Our main negative result is that there is no polysize AC-representation in general. On the positive side we show that finding such an AC-representation is fixed-parameter tractable (fpt) in the number of equations. Then we turn to a stronger criterion of representation, namely propagation completeness ("PC") --- while AC only covers the variables of S, now all the variables in F (the variables in S plus auxiliary variables) are considered for PC. We show that the standard translation actually yields a PC representation for one equation, but fails so for two equations (in fact arbitrarily badly). We show that with a more intelligent translation we can also easily compute a translation to PC for two equations. We conjecture that computing a representation in PC is fpt in the number of equations.Comment: 39 pages; 2nd v. improved handling of acyclic systems, free-standing proof of the transformation from AC-representations to monotone circuits, improved wording and literature review; 3rd v. updated literature, strengthened treatment of monotonisation, improved discussions; 4th v. update of literature, discussions and formulations, more details and examples; conference v. to appear LATA 201

Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data

Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by data uncertainty. Existing CP approaches that accommodate uncertainty are less suited to uncertainty arising due to incomplete and erroneous data, because they do not build reliable models and solutions guaranteed to address the user's genuine problem as she perceives it. Other fields such as reliable computation offer combinations of models and associated methods to handle these types of uncertain data, but lack an expressive framework characterising the resolution methodology independently of the model. We present a unifying framework that extends the CP formalism in both model and solutions, to tackle ill-defined combinatorial problems with incomplete or erroneous data. The certainty closure framework brings together modelling and solving methodologies from different fields into the CP paradigm to provide reliable and efficient approches for uncertain constraint problems. We demonstrate the applicability of the framework on a case study in network diagnosis. We define resolution forms that give generic templates, and their associated operational semantics, to derive practical solution methods for reliable solutions.Comment: Revised versio

Analysis and Verification of Service Interaction Protocols - A Brief Survey

Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing. Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. In this paper, we first overview some formal models proposed in the literature to describe services. Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.Comment: In Proceedings TAV-WEB 2010, arXiv:1009.330

DOSCATs: Double standards for protein quantification

The two most common techniques for absolute protein quantification are based on either mass spectrometry (MS) or on immunochemical techniques, such as western blotting (WB). Western blotting is most often used for protein identification or relative quantification, but can also be deployed for absolute quantification if appropriate calibration standards are used. MS based techniques offer superior data quality and reproducibility, but WB offers greater sensitivity and accessibility to most researchers. It would be advantageous to apply both techniques for orthogonal quantification, but workflows rarely overlap. We describe DOSCATs (DOuble Standard conCATamers), novel calibration standards based on QconCAT technology, to unite these platforms. DOSCATs combine a series of epitope sequences concatenated with tryptic peptides in a single artificial protein to create internal tryptic peptide standards for MS as well as an intact protein bearing multiple linear epitopes. A DOSCAT protein was designed and constructed to quantify five proteins of the NF-κB pathway. For three target proteins, protein fold change and absolute copy per cell values measured by MS and WB were in excellent agreement. This demonstrates that DOSCATs can be used as multiplexed, dual purpose standards, readily deployed in a single workflow, supporting seamless quantitative transition from MS to WB

Constraint solving in uncertain and dynamic environments - a survey

International audienceThis article follows a tutorial, given by the authors on dynamic constraint solving at CP 2003 (Ninth International Conference on Principles and Practice of Constraint Programming) in Kinsale, Ireland. It aims at offering an overview of the main approaches and techniques that have been proposed in the domain of constraint satisfaction to deal with uncertain and dynamic environments

Subcellular peptide localization in single identified neurons by capillary microsampling mass spectrometry

Single cell mass spectrometry (MS) is uniquely positioned for the sequencing and identification of peptides in rare cells. Small peptides can take on different roles in subcellular compartments. Whereas some peptides serve as neurotransmitters in the cytoplasm, they can also function as transcription factors in the nucleus. Thus, there is a need to analyze the subcellular peptide compositions in identified single cells. Here, we apply capillary microsampling MS with ion mobility separation for the sequencing of peptides in single neurons of the mollusk Lymnaea stagnalis, and the analysis of peptide distributions between the cytoplasm and nucleus of identified single neurons that are known to express cardioactive Phe-Met-Arg-Phe amide-like (FMRFamide-like) neuropeptides. Nuclei and cytoplasm of Type 1 and Type 2 F group (Fgp) neurons were analyzed for neuropeptides cleaved from the protein precursors encoded by alternative splicing products of the FMRFamide gene. Relative abundances of nine neuropeptides were determined in the cytoplasm. The nuclei contained six of these peptides at different abundances. Enabled by its relative enrichment in Fgp neurons, a new 28-residue neuropeptide was sequenced by tandem MS

Distribution of Alarin Immunoreactivity in the Mouse Brain

Alarin is a 25 amino acid peptide that belongs to the galanin peptide family. It is derived from the galanin-like peptide gene by a splice variant, which excludes exon 3. Alarin was first identified in gangliocytes of neuroblastic tumors and later shown to have a vasoactive function in the skin. Recently, alarin was demonstrated to stimulate food intake as well as the hypothalamic–pituitary–gonadal axis in rodents, suggesting that it might be a neuromodulatory peptide in the brain. However, the individual neurons in the central nervous system that express alarin have not been identified. Here, we determined the distribution of alarin-like immunoreactivity (alarin-LI) in the adult murine brain. The specificity of the antibody against alarin was demonstrated by the absence of labeling after pre-absorption of the antiserum with synthetic alarin peptide and in transgenic mouse brains lacking neurons expressing the GALP gene. Alarin-LI was observed in different areas of the murine brain. A high intensity of alarin-LI was detected in the accessory olfactory bulb, the medial preoptic area, the amygdala, different nuclei of the hypothalamus such as the arcuate nucleus and the ventromedial hypothalamic nucleus, the trigeminal complex, the locus coeruleus, the ventral chochlear nucleus, the facial nucleus, and the epithelial layer of the plexus choroideus. The distinct expression pattern of alarin in the adult mouse brain suggests potential functions in reproduction and metabolism